A Multi-Phase Search Approach to the LEGO Construction Problem

نویسنده

  • Ben Stephenson
چکیده

The task of determining which LEGO bricks to use to construct a volume is known as the LEGO Construction Problem. This is a challenging problem because even small volumes can be constructed in a tremendously large number of ways. As a result, an exhaustive search is impractical, and more nuanced search strategies must be employed to find a good, though not necessarily optimal, solution. This paper describes a multi-phase search approach to the LEGO Construction Problem. Our first search phase uses heuristics to identify a moderate number of candidates for each layer in the model. This is followed by two different search strategies which identify alternative brick arrangements that reduce the number of connected components, undesirable edges, and bricks in the model. A final highly localized search is applied to bricks at the boundaries between the model’s connected components if the previous search processes fail to reduce the model to a single connected component. Applying this four-phase search strategy to a diverse selection of models has demonstrated that it normally finds a result that consists of a single connected component when such a solution exists, and that the models are structurally

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Phase Hybrid Heuristic Method for a Multi-Depot Inventory-Routing Problem

In this study, a two phase hybrid heuristic approach was proposed to solve the multi-depot multi-vehicle inventory routing problem (MDMVIRP). Inventory routing problem (IRP) is one of the major issues in the supply chain networks that arise in the context of vendor managed systems (VMI) The MDMVIRP combines inventory management and routing decision. We are given on input a fleet of homogeneous ...

متن کامل

Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem

  Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...

متن کامل

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

متن کامل

A multi-product, multi-period model to select supplier for deteriorating products while considering uncertainty as well as backorder

Determining supplier and optimum order of the quantity is an issue of great importance in logistics management for many companies. In this regard, it is crucial to determine the best decisions for the order quantity as well as the most suitable supplier through considering existing limitations and uncertainties. To optimize a multi-product, multi-period model with select supplier for deteriorat...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016